"-0x2l4x78j]b8%0%k!<%wdl?. ("-co) %w%m%h%3%k N)@n 7i9t Blbt @? El5~ee5!bg3xm}9)3xit7p1d9)3x2j "-causally Ordering Group Communication ("-co) Protocol

نویسنده

  • Takayuki Tachikawa
چکیده

The distributed applications require group communication of multimedia data among multiple processes. A message including multimedia data at the application level is decomposed into smaller packets at the communication system level. In this paper, we discuss the ordered, atomic, and non-loss delivery of messages at the application level not at the system level. In some multimedia applications, the application processes do not mind if some packets are lost. The application process species the minimum receipt ratio " (1) showing at least how many percentages of whole data in each message the destination process has to receive. The communication system delivers the packets to the destinations in the group so as to satisfy the receipt constraint ". The protocol is based on the fully distributed control scheme, and uses high-speed networks where the process may lose packets due to the buer overrun and congestion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

J,;67?%w%m%h%3%k$rmq$$$?a*bre*%0%k!<%wdl?. N)@n 7i9t Blbt @? El5~ee5!bg3xm}9)3xit7p1d9)3x2j Distributed Protocol for Selective Intra-group Communication

In distributed applications, a group of application processes is established and the processes in the group communicate with each other. i.e. intra-group communication. Here, messages have to be atomically delivered to all the destinations and be causally ordered. In addition, the processes send messages to any subset of the group at any time. This paper presents an intra-group communication pr...

متن کامل

Information Flow Control in Distributed Systems

J,;6%7%9%F%‘$K$*$1$k>pJsN.@)8f 0BED >;;K N)@n 7I9T BlBt @? El5~EE5!Bg3XM}9)3XIt7P1D9)3X2J J,;61~MQ$O!"J#?t$N%*%V%8%’%/%H$+$i$J$k%0%k!<%W$,DL?.LV$rDL$8$F%a%C%;!<%8$N8r49$r9T$&$3$H$G]7?A‘:n1i;;$NBP$K$h$jI=8=$5$l!"%*%V%8%’%/%H$K$h$jDs6!$5$l$kA‘ 1i;;$rDL$7$F$N$_A‘:n$9$k$3$H$,$G$-$k!#$^$?!"A‘:n1i;;$O$5$i$KB>$N%*%V%8%’%/%H$,Ds6!$9$kA‘:n1i;;$r $S=P$9$3$H$,$"$k...

متن کامل

Achieving High Performance for Parallel Programs That Contain Unscalable Modules a Dissertation

This thesis is a description of a compiler and runtime technique for the e cient management of threads including their mutual exclusion. The target area for this work is parallel languages for shared-memory multiprocessors. The goal of this work is to achieve a situation in which the execution time either decreases or remains unchanged as the number of processors is increased. We call this perf...

متن کامل

Exploiting Interaction with Environment to Solve Some of Hard Classication Problems and Its Experimental Demonstration

Conventional Arti cial Intelligence and cognitive science have been argueing the emergence of intelligence by completely separating the system from its environment. In this paper, we will intensively investigate and analyze the role of the system-environment interaction through the comparison between the information processing and embodied cognitive approaches. By taking account of this interac...

متن کامل

LZGn 5 W , 0 KF # 1 QB ’

Recently, researchers have tried to apply ILP to KDD because ILP enlarges the applicability of Machine Learning to cover KDD and Data Mining: it enables them to learn from multiple relational tables. Many scienti c discovery systems are motivated from the desire to deal with larger databases. However the larger the databases are, the more computational power we need. Parallel computing is a pos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995